Revisiting Williams on Integrity

Revisiting and Improving a Result on Integrity Preservation by Concurrent Transactions

We revisit a well-known result on the preservation of integrity by concurrent transactions. It says that the serializability of integrity-preserving transactions yields integrity-preserving histories. We improve it in two ways. First, we discuss divergent interpretations and restate them more precisely. Second, we make it applicable in the presence of inconsistency.

A Survey on Complexity of Integrity Parameter

Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...

The Williams Bjerknes Model on Regular Trees

We consider the Williams Bjerknes model, also known as the biased voter model on the d-regular tree T, where d ≥ 3. Starting from an initial configuration of “healthy” and “infected” vertices, infected vertices infect their neighbors at Poisson rate λ ≥ 1, while healthy vertices heal their neighbors at Poisson rate 1. All vertices act independently. It is well known that starting from a configu...

Williams, T

This paper describes a study of a large design and manufacture engineering project, undertaken as part of a Delay and Disruption litigation. Design changes and delays in design approval would have caused delay to the project; in order to fulfil a tight time-constraint, management had to increase parallel development in the network logic, reducing delay but setting up feed-back loops that marked...

Mariam Williams